Application of Non-negative sparse matrix factorization in occluded face recognition

نویسندگان

  • Liying Lang
  • XueKe Jing
چکیده

In order to reduce the impact of block for the rate of face recognition ,in this paper, through the control of sparseness in the non-negative matrix factorization , the face image do non-negative sparse coding to obtain the eigenspace for the image. The experiment uses the ORL face database. The experimental results show that using NMFs obtains Eigenfaces with the local features of face and has a strong ability to express the occluded human face. The algorithm has good adaptability to partial occlusion, and has better robustness than PCA algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...

متن کامل

Voice-based Age and Gender Recognition using Training Generative Sparse Model

Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...

متن کامل

Complex Matrix Factorization for Face Recognition

— This work proposes a novel method of matrix factorization on the complex domain to obtain both intuitive features and high recognition results in a face recognition system. The real data matrix is transformed into a complex number based on the Euler representation of complex numbers. Base complex matrix factorization (CMF) is developed and two extensions including sparse complex matrix factor...

متن کامل

Local Application of Non Negative Matrix Factorization Algorithm in Face Recognition

Face recognition is a challenging issue in the field of multi-science, the main contents of the research is how to make computer have the ability of face recognition face recognition technology involved in a lot, which is a key feature extraction and classification method, this paper focuses on the study of related theory. Non-negative matrix factorization trapped MF) algorithm and local non-ne...

متن کامل

Improving LNMF Performance of Facial Expression Recognition via Significant Parts Extraction using Shapley Value

Nonnegative Matrix Factorization (NMF) algorithms have been utilized in a wide range of real applications. NMF is done by several researchers to its part based representation property especially in the facial expression recognition problem. It decomposes a face image into its essential parts (e.g. nose, lips, etc.) but in all previous attempts, it is neglected that all features achieved by NMF ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCP

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011